Diffusion Models and Steady-state Approximations for Exponentially Ergodic Markovian Queues by Itai Gurvich

نویسنده

  • I. GURVICH
چکیده

Motivated by queues with many-servers, we study Brownian steady-state approximations for continuous time Markov chains (CTMCs). Our approximations are based on diffusion models (rather than a diffusion limit) whose steady-state, we prove, approximates well that of the Markov chain. Strong approximations provide such “limitless” approximations for process dynamics. Our focus here is on steady-state distributions and the diffusion model that we propose is tractable relative to strong approximations. Within an asymptotic framework, in which a scale parameter n is taken large, a uniform (in the scale parameter) Lyapunov condition is proved to guarantee that the gap between steady-state moments of the diffusion and those of the properly centered and scaled CTMCs, shrinks at a rate of √ n. The uniform Lyapunov requirement is satisfied, in particular, if the scaled and centered sequence converges to a diffusion limit for which a Lyapunov condition is satisfied. Our proofs build on gradient estimates for the solutions of the Poisson equations associated with the (sequence of) diffusion models together with elementary Martingale arguments. As a by product of our analysis, we explore connections between Lyapunov functions for the Fluid Model, the Diffusion Model and the CTMC.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Exponential Approximations for Tail Probabilities in Queues II: Sojourn Time and Workload

We continue to focus on simple exponential approximations for steady-state tail probabilities in queues based on asymptotics. For the G/GI/1 model with i.i.d. service times that are independent of an arbitrary stationary arrival process, we relate the asymptotics for the steadystate waiting time, sojourn time and workload. We show that the three asymptotic decay rates coincide and that the thre...

متن کامل

Exponential Approximations for Tail Probabilities in Queues: Sojourn Time and Workload

In this paper, we focus on simple exponential approximations for steady-state tail probabilities in G/GI/1 queues based on large-time asymptotics. We relate the large-time asymptotics for the steady-state waiting time, sojourn time and workload. We evaluate the exponential approximations based on the exact asymptotic parameters and their approximations by making comparisons with exact numerical...

متن کامل

Fluid Models for Multiserver Queues with Abandonments

Deterministic fluid models are developed to provide simple first-order performance descriptions for multi-server queues with abandonment under heavy loads. Motivated by telephone call centers, the focus is on multi-server queues with a large number of servers and non-exponential service-time and time-to-abandon distributions. The first fluid model serves as an approximation for the G/GI/s + GI ...

متن کامل

Excursion-Based Universal Approximations for the Erlang-A Queue in Steady-State

We re-visit many-server approximations for the well-studied Erlang-A queue. This is a system with a single pool of i.i.d. servers that serve one class of impatient i.i.d. customers. Arrivals follow a Poisson process and service times are exponentially distributed as are the customers’ patience times. We propose a diffusion approximation which applies simultaneously to all existing many-server h...

متن کامل

A Diffusion Approximation for a Markovian Queue with Reneging

Consider a single-server queue with a Poisson arrival process and exponential processing times in which each customer independently reneges after an exponentially distributed amount of time. We establish that this system can be approximated by either a reflected Ornstein–Uhlenbeck process or a reflected affine diffusion when the arrival rate exceeds or is close to the processing rate and the re...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013